Parallel fractal decomposition based algorithm for big continuous optimization problems
نویسندگان
چکیده
منابع مشابه
EVALUATING EFFICIENCY OF BIG-BANG BIG-CRUNCH ALGORITHM IN BENCHMARK ENGINEERING OPTIMIZATION PROBLEMS
Engineering optimization needs easy-to-use and efficient optimization tools that can be employed for practical purposes. In this context, stochastic search techniques have good reputation and wide acceptability as being powerful tools for solving complex engineering optimization problems. However, increased complexity of some metaheuristic algorithms sometimes makes it difficult for engineers t...
متن کاملSampling-based adaptive bounding evolutionary algorithm for continuous optimization problems
This paper proposes a novel sampling-based adaptive bounding evolutionary algorithm termed SABEA that is capable of dynamically updating the search space during the evolution process for continuous optimization problems. The proposed SABEA adopts two bounding strategies, namely fitness-based bounding and probabilistic sampling-based bounding, to select a set of individuals over multiple generat...
متن کاملCultural Ant Algorithm for Continuous Optimization Problems
In order to overcome prematurity of ant colony algorithm, the conception of belief space originated in cultural algorithm is introduced, and a new cultural ant algorithm is proposed for continuous optimization problems. Firstly, the coding scheme for ant colony algorithm to solve continuous optimization problems is discussed. Then belief space is brought in, and designed as the form of two part...
متن کاملFirefly Mating Algorithm for Continuous Optimization Problems
This paper proposes a swarm intelligence algorithm, called firefly mating algorithm (FMA), for solving continuous optimization problems. FMA uses genetic algorithm as the core of the algorithm. The main feature of the algorithm is a novel mating pair selection method which is inspired by the following 2 mating behaviors of fireflies in nature: (i) the mutual attraction between males and females...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2019
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2018.06.002